Searching and Optimizing Structure Ensembles for Complex Flexible Sugars
نویسندگان
چکیده
منابع مشابه
Database searching by flexible protein structure alignment.
We have recently developed a flexible protein structure alignment program (FATCAT) that identifies structural similarity, at the same time accounting for flexibility of protein structures. One of the most important applications of a structure alignment method is to aid in functional annotations by identifying similar structures in large structural databases. However, none of the flexible struct...
متن کاملGenetic Approach for Optimizing Ensembles of Classifiers
An ensemble of classifiers is a set of classifiers whose predictions are combined in some way to classify new instances. Early research has shown that, in general, an ensemble of classifiers is more accurate than any of the single classifiers in the ensemble. Usually the gains obtained by combining different classifiers are more affected by the chosen classifiers than by the used combination. I...
متن کاملFATCAT: a web server for flexible structure comparison and structure similarity searching
Protein structure comparison, an important problem in structural biology, has two main applications: (i) comparing two protein structures in order to identify the similarities and differences between them, and (ii) searching for structures similar to a query structure. Many web-based resources for both applications are available, but all are based on rigid structural alignment algorithms. FATCA...
متن کاملFlexible Searching for Graph Aggregation Hierarchy
Abstract— Signature technique for multi-key indexing is proposed for flexible searching in the area of database. In this paper, the signature technique called the Join Signature file is presented to cover graph aggregation hierarchy. The structure of Join Signature is flexible enough so that the predicate can occur at any classes in the hierarchy and the target can be anywhere in the graph ag...
متن کاملParallel Architecture for Flexible Approximate Text Searching
This paper presents a processor array design for flexible approximate string matching. Initially, a sequential algorithm is discussed which consists of two phases, i.e. preprocessing and searching. Then, starting from the computational schedule of the searching phase a parallel architecture is derived. Further, the preprocessing phase is also accomodated onto the same architecture. Key-Words: A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Chemical Society
سال: 2011
ISSN: 0002-7863,1520-5126
DOI: 10.1021/ja205251j